This then converts the aggregated results in Shared Context into an appropriate request message for the Callout node. 然后将共享上下文中的聚合结果转换为Callout节点的适当请求消息。
Such a configuration is frequently referred to as a shared disk cluster, but it is actually a shared-nothing architecture, as no disk is accessed by more than one node at a time. 这种配置经常被称作共享磁盘群集,不过,实际上,这是一个什么都不共享的体系结构,因为在同一时刻任何磁盘都只能被一个节点访问。
Set the scope of the shared library; it's one of a Cell, a Node, and a Server. 设置共享库的范围;可以是计算单元、节点和服务器中的一个。
Set appropriate permissions on the shared directories using commands shown below on the node ha1 在节点ha1上使用下面所示的命令为共享的目录设置适当的权限
Install IBM HTTP Server on the shared disk/ VG ( ihsvg) of fallover/ failover/ standby/ standalone node or on the same node depending on the requirement. 在故障转移/备用/孤立节点的共享磁盘/VG(ihsvg)上安装IBMHTTPServer,或者根据需求在同一节点上安装。
In this mode, the shared volume groups are accessible by multiple PowerHA nodes, which results in faster failover ( disk takeover) in the event of a node failure. 在这种模式下,多个PowerHA节点都可以访问共享卷组,这会加快发生节点故障时的故障转移(磁盘接管)。
A queue manager that will be used in a high availability cluster needs to have its logs and data on shared disks, so that they can be accessed by a surviving node in the event of a node failure. 用于高可用性集群的队列管理器在共享磁盘上应该有自己的日志和数据,以便在节点故障时可通过一个幸存节点对其进行访问。
The trees are not disjointed, however; each mount node in the copied tree is shared with the corresponding mount node in the initial tree. 但是,这些拷贝互不相连;复制的树中的每个挂载节点共享初始节点中对应的挂载节点。
When a failure occurs on a shared disk cluster, it's critical that no other node in the cluster reads or updates from disk any pages that might not have been recovered yet. 当共享磁盘集群上出现故障时,关键是没有集群中的其他节点从磁盘读取或更新尚未恢复的页。
NOTE: In general, note that should a node fail if shared memory or disk buffering is used then this data will be lost when the second node takes over. 注意:通常,当一个结点有故障,如果使用共享内存或磁盘缓冲区,第二个结点接管时数据都被丢弃。
The algorithm computes the subset of those destinations that can be reached with a shared tree centered at each node, transforms the problem into a set-covering problem, and solves it by using a method based on matrix. 该算法计算以每个节点为中心的共享树所能达到的目的节点的子集,将原问题转换为集合覆盖问题,并采用基于矩阵的启发式算法进行求解。
Research on distributed shared memory system supporting runtime node reconfiguration 实时重新配置的分布式共享存储的研究
A distributed shared parallel I/ O system based on independent I/ O node is proposed, and its key technology has been researched thoroughly, focusing on hardware design of parallel I/ O system. 提出了一种基于独立I/O节点的分布共享并行I/O系统方案,并对其关键技术进行了深入研究。
The master private key is shared by the private key of every node. Threshold and identity-based key management and authentication are used. 各节点使用其身份作为公钥,主密钥由各节点的私钥分享,从而形成基于身份的门限分布式密钥管理。
The formulation of communication protocol is used to update the shared states and maintain the consistency of each simulation node. 制定数据通信协议,更新仿真系统的动态共享状态,维护仿真系统中各仿真节点状态的一致性。
Node information shared on the internet and it can be applied to intelligent transportation node. 在互联网中,通过共享节点信息,搭建可应用于智能交通的物联网感知节点。
In the implementation chapter, we explained technology including lock-free ring buffer, shared memory for inter process, optimization of busy waiting, node/ flow hash algorithms, and so on, to improve efficiency of the distributed system. 在系统实现环节,讲解了包括无锁环形缓冲区,进程间共享内存,忙等待优化,节点、流哈希算法等在内的多种优化技术,在实现分布式的同时提高系统的整体性能。
In addition, in order to provide smooth access of services, the system uses ARP cheat to achieve the floating IP address shared between Installer Node and Failover node. 此外,为了给用户提供平滑的服务访问,本系统采用ARP欺骗方式实现了共享于主备管理节点间的浮动IP地址机制。
Every query node randomly generates a path and sends a query message along the path. When multiple query messages pass through a common node, they are shared by using the copy of each query message at this node. 该算法首先由每个查询节点随机产生一条路径并下发查询消息,当多个查询消息在某一节点相遇时,利用该节点保存的各查询消息副本,共享这多个查询消息。
However, most P2P systems are built on the assumption that users are willing to provide shared resources, obviously this assumption ignores the node consider their own interests, the ability to act in accordance with the established protocol. 然而目前大多数P2P应用都建立在用户愿意提供共享资源的假设之上,这一假设忽视了节点出于自身利益考虑不按既定协议行事的情形。